Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
731	Multiplicative approximations of random walk transition probabilities Michael Kapralov∗ Rina Panigrahy† June 17, 2011 Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Random walk NP-complete problems Algebraic graph theory Centrality Tutte polynomial Theoretical computer science Computational complexity theory Mathematics
732	Curriculum Vitae of Uriel Feige Contact Information Department of Computer Science and Applied Mathematics The Weizmann Institute of Science Rehovot 76100, ISRAEL Phones (office), (cell) Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-01 11:38:31 Computational complexity theory Complexity classes Approximation algorithm NP-complete ACM SIGACT European Symposium on Algorithms International Colloquium on Automata Languages and Programming Uriel Feige Algorithm Theoretical computer science Applied mathematics Computer science
733	MUSIC FOR LIFE Complete Piano Chords Contents Section 1 Add to Reading List Source URL: www.mayfairmusic.com Language: English - Date: 2014-05-15 10:12:34 Seventh chords Chromaticism Music theory Chord Root Sixth chord Diminished seventh chord Inversion Third Music Harmony Chords
734	Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:11:43 Complexity classes Dynamic programming NP-complete problems Operations research P versus NP problem Time complexity Knapsack problem P Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics
735	Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-02 11:07:07 Complexity classes Mathematical optimization Structural complexity theory Computational resources P versus NP problem NP-complete Circuit complexity P Time hierarchy theorem Theoretical computer science Computational complexity theory Applied mathematics
736	MACQUARIE UNIVERSITY STATISTICS DEPARTMENT SEMINAR Speaker: A/Prof Xinyuan Song, Department of Statistics, Chinese University of Hong Kong Date: Tuesday 28 April 2015, Time 2pm Venue: E4A523 Title: Statistics analysis of Add to Reading List Source URL: stat.mq.edu.au Language: English - Date: 2015-04-19 22:05:02 Bioinformatics Hidden Markov model Expectation–maximization algorithm Latent variable Estimation theory Book:Machine Learning - The Complete Guide Statistics Statistical models Markov models
737	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:49:01 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity NP-complete Vertex cover Time complexity Travelling salesman problem Matching Theoretical computer science Computational complexity theory Applied mathematics
738	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
739	Fixed-Parameter Algorithms for Covering Points with Lines Apichat Heednacram PhD Student Supervisors: Prof. Vladimir Estivill-Castro Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:27 Parameterized complexity Analysis of algorithms Time complexity NP-complete problems Algorithm Theoretical computer science Applied mathematics Computational complexity theory
740	Claw-free graphs and two conjectures on omega, Delta, and chi Andrew King School of Computer Science McGill University, Montreal October 2009 Add to Reading List Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com Language: English - Date: 2015-03-20 01:35:59 Graph operations Line graph Claw-free graph Clique Perfect graph Chordal graph Interval graph Neighbourhood Graph property Graph theory Graph coloring NP-complete problems

UPDATE